A Mathematical Method for Managing the System Constraint
Authors
Abstract:
The goal of theory of constraints (TOC) is to maximize output, which is achieved byidentifying and managing the critically constrained resources. To manage the constraints, Goldrattproposed five focusing steps (5FS). If we increase constrained output, the output of system will beincreased. In this paper, we focus on step four of the 5FS and use the remained capacity of nonconstraintto elevate the system’s constraint.
similar resources
A Mathematical Method for Managing Inventories in a Dual Channel Supply Chain
The advent of e-commerce has prompted many manufacturers to redesign their traditional channel structure by engaging in direct sales. In this paper, we present a dual channel inventory model based on queuing theory in a manufacturer-retailer supply chain, consisting of a traditional retail channel and a direct channel which stocks are kept in both upper and lower echelon. The system receives ...
full textA multi-objective mathematical model for nurse scheduling problem with hybrid DEA and augmented ε-constraint method: A case study
The efficient management of nursing personnel is of vital importance in a hospital’s environment comprising a vast share of the hospital’s operational costs. In the nurse scheduling problem (NSP), the target is to allocate shifts to the nurses in order to satisfy the hospital’s demand during the planning horizon by considering different objective functions. This paper presents a multi-objective...
full texta mathematical method for managing inventories in a dual channel supply chain
the advent of e-commerce has prompted many manufacturers to redesign their traditional channel structure by engaging in direct sales. in this paper, we present a dual channel inventory model based on queuing theory in a manufacturer-retailer supply chain, consisting of a traditional retail channel and a direct channel which stocks are kept in both upper and lower echelon. the system receives st...
full textA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
full textA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...
full textA Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations
In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
full textMy Resources
Journal title
volume 24 issue 1
pages 37- 47
publication date 2011-01-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023